Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(x, x) -> f2(g1(x), x)
g1(x) -> s1(x)

Q is empty.


↳ QTRS
  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(x, x) -> f2(g1(x), x)
g1(x) -> s1(x)

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(x, x) -> f2(g1(x), x)
g1(x) -> s1(x)

The set Q consists of the following terms:

f2(x0, x0)
g1(x0)


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F2(x, x) -> F2(g1(x), x)
F2(x, x) -> G1(x)

The TRS R consists of the following rules:

f2(x, x) -> f2(g1(x), x)
g1(x) -> s1(x)

The set Q consists of the following terms:

f2(x0, x0)
g1(x0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F2(x, x) -> F2(g1(x), x)
F2(x, x) -> G1(x)

The TRS R consists of the following rules:

f2(x, x) -> f2(g1(x), x)
g1(x) -> s1(x)

The set Q consists of the following terms:

f2(x0, x0)
g1(x0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F2(x, x) -> F2(g1(x), x)

The TRS R consists of the following rules:

f2(x, x) -> f2(g1(x), x)
g1(x) -> s1(x)

The set Q consists of the following terms:

f2(x0, x0)
g1(x0)

We have to consider all minimal (P,Q,R)-chains.